Data-Structures-and-Algorithms/Python/DIVIDE THE LIST INTO THREE STACKS.py at main · codemistic/Data-Structures-and-Algorithms · GitHub

Name: Data-Structures-and-Algorithms/Python/DIVIDE THE LIST INTO THREE STACKS.py at main · codemistic/Data-Structures-and-Algorithms · GitHub
Rating: 4.8 (364 reviews)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
# PYTHON CODE TO DIVIDE THE LIST INTO THREE STACKS

classMultiStack:
def__init__(self,stacksize):
self.numberstacks=3
self.custList=[0]*(stacksize*self.numberstacks)
self.sizes=[0]*self.numberstacks
self.stacksize=stacksize

defisFull(self,stacknum):
ifself.sizes[stacknum]==self.stacksize:
returnTrue
else:
returnFalse

defisEmpty(self,stacknum):
ifself.sizes[stacknum]==0:
returnTrue
else:
returnFalse

defindexOfTop(self,stacknum):
offset=stacknum*self.stacksize
returnoffset+self.sizes[stacknum]-1

defpush(self,item,stacknum):
ifself.isFull(stacknum):
return"stack is full"
else:
self.sizes[stacknum]+=1
self.custList[self.indexOfTop(stacknum)]=item

defpop(self,stacknum):
ifself.isEmpty(stacknum):
return"stack is empty"
else:
value=self.custList[self.indexOfTop(stacknum)]
self.custList[self.indexOfTop(stacknum)]=0
self.sizes[stacknum]-=1
returnvalue

defpop(self,stacknum):
ifself.isEmpty(stacknum):
return"stack is empty"
else:
value=self.custList[self.indexOfTop(stacknum)]
returnvalue